A Dynamic Localized Adjustable Force Field Method for Real-time Assistive Non-holonomic Mobile Robotics

Providing an assistive navigation system that augments rather than usurps user control of a powered wheelchair represents a significant technical challenge. This paper evaluates an assistive collision avoidance method for a powered wheelchair that allows the user to navigate safely whilst maintaining their overall governance of the platform motion. The paper shows that by shaping, switching and adjusting localized potential fields we are able to negotiate different obstacles by generating a more intuitively natural trajectory, one that does not deviate significantly from the operator in the loop desired-trajectory. It can also be seen that this method does not suffer from the local minima problem, or narrow corridor and proximity oscillation, which are common problems that occur when using potential fields. Furthermore this localized method enables the robotic platform to pass very close to obstacles, such as when negotiating a narrow passage or doorway

Assistive trajectories for human-in-the-loop mobile robotic platforms

Autonomous and semi-autonomous smoothly interruptible trajectories are developed which are highly suitable for application in tele-operated mobile robots, operator on-board military mobile ground platforms, and other mobility assistance platforms. These trajectories will allow a navigational system to provide assistance to the operator in the loop, for purpose built robots or remotely operated platforms. This will allow the platform to function well beyond the line-of-sight of the operator, enabling remote operation inside a building, surveillance, or advanced observations whilst keeping the operator in a safe location. In addition, on-board operators can be assisted to navigate without collision when distracted, or under-fire, or when physically disabled by injury

Multi-dimensional key generation of ICMetrics for cloud computing

Despite the rapid expansion and uptake of cloud based services, lack of trust in the provenance of such services represents a significant inhibiting factor in the further expansion of such service. This paper explores an approach to assure trust and provenance in cloud based services via the generation of digital signatures using properties or features derived from their own construction and software behaviour. The resulting system removes the need for a server to store a private key in a typical Public/Private-Key Infrastructure for data sources. Rather, keys are generated at run-time by features obtained as service execution proceeds. In this paper we investigate several potential software features for suitability during the employment of a cloud service identification system. The generation of stable and unique digital identity from features in Cloud computing is challenging because of the unstable operation environments that implies the features employed are likely to vary under normal operating conditions. To address this, we introduce a multi-dimensional key generation technology which maps from multi-dimensional feature space directly to a key space. Subsequently, a smooth entropy algorithm is developed to evaluate the entropy of key space

A novel cost-effective Pressure Sensor based Smart Car park system

With the increase in number of people using vehicles for transportation since last decade, traffic congestion is a major problem that requires to be solved effectively. Smart car park system is considered as one of the strategic solutions to this problem, which involves use of sensors to collect data. This paper proposes a novel low-cost smart car monitoring system to detect number of incoming and outgoing cars in and/or out of the car park using pressure sensors. This system also provides the data for the number of spaces available in the car park. Additionally, the paper also demonstrates the algorithm used to process the data obtained by the sensors to use it as a useful information

Non-overlapping dual camera fall detection using the NAO humanoid robot

With an aging population and a greater desire for independence, the dangers of falling incidents in the elderly have become particularly pronounced. In light of this, several technologies have been developed with the aim of preventing or monitoring falls. Failing to strike the balance between several factors including reliability, complexity and invasion of privacy has seen prohibitive in the uptake of these systems. Some systems rely on cameras being mounted in all rooms of a user's home while others require being worn 24 hours a day. This paper explores a system using a humanoid NAO robot with dual vertically mounted cameras to perform the task of fall detection

A study on iris textural correlation using steering kernels

Research on iris recognition have observed that iris texture has inherent radial correlation. However, currently, there lacks a deeper insight into iris textural correlation. Few research focus on a quantitative and comprehensive analysis on this correlation. In this paper, we perform a quantitative analysis on iris textural correlation. We employ steering kernels to model the textural correlation in images. We conduct experiments on three benchmark datasets covering iris captures with varying quality. We find that the local textural correlation varies due to local characteristics in iris images, while the general trend of textural correlation goes along the radial direction. Moreover, we demonstrate that the information on iris textural correlation can be utilized to improve iris recognition. We employ this information to produce iris codes. We show that the iris code with the information on textural correlation achieves an improved performance compared to traditional iris codes

Optimal Generation of Iris Codes for Iris Recognition

The calculation of binary iris codes from feature values (e.g. the result of Gabor transform) is a key step in iris recognition systems. Traditional binarization method based on the sign of feature values has achieved very promising performance. However, currently, little research focuses on a deeper insight into this binarization method to produce iris codes. In this paper, we illustrate the iris code calculation from the perspective of optimization. We demonstrate that the traditional iris code is the solution of an optimization problem which minimizes the distance between the feature values and iris codes. Furthermore, we show that more effective iris codes can be obtained by adding terms to the objective function of this optimization problem. We investigate two additional objective terms. The first objective term exploits the spatial relationships of the bits in different positions of an iris code. The second objective term mitigates the influence of less reliable bits in iris codes. The two objective terms can be applied to the optimization problem individually, or in a combined scheme. We conduct experiments on four benchmark datasets with varying image quality. The experimental results demonstrate that the iris code produced by solving the optimization problem with the two additional objective terms achieves a generally improved performance in comparison to the traditional iris code calculated by binarizing feature values based on their signs

Signal-Level Information Fusion for Less Constrained Iris Recognition using Sparse-Error Low Rank Matrix Factorization

Iris recognition systems working in less constrained environments with the subject at-a-distance and on-the-move suffer from the noise and degradations in the iris captures. These noise and degradations significantly deteriorate iris recognition performance. In this paper, we propose a novel signal-level information fusion method to mitigate the influence of noise and degradations for less constrained iris recognition systems. The proposed method is based on low rank approximation (LRA). Given multiple noisy captures of the same eye, we assume that: 1) the potential noiseless images lie in a low rank subspace and 2) the noise is spatially sparse. Based on these assumptions, we seek an LRA of noisy captures to separate the noiseless images and noise for information fusion. Specifically, we propose a sparse-error low rank matrix factorization model to perform LRA, decomposing the noisy captures into a low rank component and a sparse error component. The low rank component estimates the potential noiseless images, while the error component models the noise. Then, the low rank and error components are utilized to perform signal-level fusion separately, producing two individually fused images. Finally, we combine the two fused images at the code level to produce one iris code as the final fusion result. Experiments on benchmark data sets demonstrate that the proposed signal-level fusion method is able to achieve a generally improved iris recognition performance in less constrained environment, in comparison with the existing iris recognition algorithms, especially for the iris captures with heavy noise and low quality

Identification of Transmitting Antennas in Secure Internet of Things Networks

Bluetooth and WIFI channels are open to public users and have few security procedures. One security aspect is for a receiver to be able to verify the identity of the transmitter. This paper describes methods of identifying transmitters by the properties of their antennas